package com.yeung.exam;

import java.util.Scanner;
import java.util.TreeSet;

public class TP99_58 {
    public static void main(String[] args) {
//        System.out.println((int)'?');
        Scanner sc = new Scanner(System.in);
        int count = 200;
        int[] input = new int[count];
        for (int i = 0; i < count; i++) {
            input[i] = sc.nextInt();
        }
        //
        TreeSet<Integer> set = new TreeSet<>();
        for (int item : input) {
            set.add(item);
        }
        //
        int result = set.last();
        for (int se : set) {
            int sum = 0;
            //看有多少比这个数小
            for (int it : input) {
                if (it <= se) sum++;
            }
            if ((sum * 1.0 / count) >= 0.99)
                if (se < result) result = se;
        }
        System.out.println(result);
    }
}
